Propriétés statistiques des entiers friables

Let Ψ(x,y) (resp. Ψ_m(x,y)) denote the number of integers not exceeding x that are y-friable, i.e. have no prime factor exceeding y (resp. and are coprime to m). Evaluating the ratio Ψ_m(x/d,y)/Ψ(x,y) for 1≤slantd≤slantx, m≥slant 1, x≥slant y≥slant 2, turns out to be a crucial step for estimating arithmetic sums over friable integers. Here, it is crucial to obtain formulae with a very wide range of validity. In this paper, several uniform estimates are provided for the aforementioned ratio, which supersede all previously known results. Applications are given to averages of various arithmetic functions over friable integers which in turn improve corresponding results from the literature. The technique employed rests mainly on the saddle-point method, which is an efficient and specific tool for the required design.2000 Mathematics Subject Classification: Primary—11N25; Secondary—11K65, 11N37     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

On a Question of Phillips

In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case.     

A note on a result by M. Bognár concerning the Hahn--Mazurkiewicz Theorem

Summary In this note we use Theorem 2.4 in<span lang=EN-US style='font-size:10.0pt;mso-ansi-language:EN-US'>[1]to give a very short proof of a recent result due to M. Bognár (Theorem A in [3]). We also prove that Bognár's result is in fact equivalent to the classical Hahn-Mazurkiewicz Theorem. Finally we give generalizations in the non-compact setting.     

Some remarks on the Jensen-Hadamard inequalities and applications

We provide some inequalities and integral inequalities connected to the Jensen-Hadamard inequalities for convex functions. In particular, we give some refinements to these inequalities. Some natural applications and further extensions are given.

---

Sunto Forniamo alcune diseguaglianze e diseguaglianze integrali connesse alle dise-gueglianze di Jensen-Hadamard per funzioni convesse. In particolare, diamo qualche miglioramento di queste diseguaglianze. Alcune applicazioni naturali ed ulteriori estensioni sono date.

     

长柱形CsI(Tl)闪烁晶体探测器的能量重建

提出了用于TEXONO实验中双端读出的长柱形CsI(Tl)闪烁晶体探测器的两种粒子能量重建方法———“算术平均值能量重建法”和“几何平均值能量重建法”,讨论了两种算法的理论依据和计算方法,并对两种算法进行了比较     

关于Euler-Maclaurin公式的一个注记

利用梯形公式的余项,将被积函数的二阶导数做幂级数展开,证明了余项是关于求积区间长度的奇数次幂级数.推导出了复合梯形公式的一类渐近展开式,从另一方面印证了Euler-Maclaurin公式.     

直接资本化法中自有资本收益率的算法探讨

在分析我国房地产自有资本收益率操作中所存在问题的基础上,论述了自有资本收益率的实质是自有资金直接资本化率,并在房地产持有期小于抵押贷款期以及房地产持有期和土地批租年限相同的两种情况下,推导出了与土地有限期使用制度相适应的房地产资本化率和自有资本收益率的计算方法,提出了利用债务保障比率的取值范围检验资本化率合理性的基本公式.     

The weak pigeonhole principle for function classes in S 12

It is well known that S ¹₂ cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S ¹₂ for provably weaker function classes. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)